package BinaryTree;

public class Text {
    public static void main(String[] args) {
        TreeNode node = new TreeNode(new TreeNode(new TreeNode(1),6,new TreeNode(9)),
                                        1,
                                        new TreeNode(new TreeNode(2),4,null));
        System.out.println(node.recursion(node));

/*        System.out.println(node.size(node));
        System.out.println(node.getLeveNode(node));
        System.out.println(node.getLeveNodeCount(node,1));
        System.out.println(node.getLeveNodeCount(node,2));

        System.out.println(node.getHeight(node));
        System.out.println(node.find(node,2));
        node.leveOrder(node, new Accept() {
            @Override
            public void accept(int val) {
                System.out.print(val + " ");
            }
        });*/
    }

}
